Termination Detection of Distributed Algorithms by Graph Relabelling Systems
نویسندگان
چکیده
A unified and general scheme for detecting the termination of distributed computations is proposed. This scheme uses the encoding of distributed algorithms in form of graph rewriting systems to transform the problem of adding termination detection to a distributed computation into an operation on graph rewriting systems. Various examples are used to illustrate this approach.
منابع مشابه
Tasks, Types and Tactics for Local Computation Systems
We present a formalization in Coq of local computations, a model for distributed computing based on graph relabelling. This formalization allows one to prove the correctness of distributed algorithms, as well as to compare various synchronisation and termination detection modes. We illustrate our approach by two impossibility proofs, and by a certified algorithm transformation.
متن کاملDistributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and the convergecast. This encoding allows us to derive formal, modular and simple encoding for many distributed graph algorithms. We illustrate this method by investigating the distributed computation of a breadth-first s...
متن کاملGraph Relabelling Systems: A General Overview
Graph relabelling systems have been introduced as a suitable model for expressing and studying distributed algorithms on a network of communicating processors. We recall the basic ideas underlying that model and we survey the main questions that have been considered and the main results that have been obtained in that framework.
متن کاملDistributed Control for AI
This paper discusses a number of elementary problems in distributed computing and a couple of well-known algorithmic \building blocks", which are used as procedures in distributed applications. We shall not strive for completeness, as an enumeration of the many known distributed algorithms would be pointless and endless. We do not even try to touch all relevant sub-areas and problems studied in...
متن کاملSurvey of Deadlock Detection in Distributed Concurrent Programming Environments and Its Application to Real-time Systems and Ada Invited Paper
Deadlock is one of the most serious problems in multitasking concurrent programming systems. The deadlock problem becomes further complicated when the underlying system is distributed and when tasks have timing constraints. Distributed deadlock detection has been studied to some extent in distributed database systems and distributed timesharing operating systems but has not been widely used in ...
متن کامل